SherbyNet - /page/wikibook/entry.mu

Micron Document

<!DOCTYPE html>

<title>Metasearch engine</title>

</head>

<span id="openzim-page-title" class="mw-page-title-main"><span class="mw-page-title-main">Metasearch engine</span></span>

</h1>

</header>

<p>A <b>metasearch engine</b> (or <b><a href="Search_aggregator" title="Search aggregator">search aggregator</a></b>) is an online <a href="Information_retrieval" title="Information retrieval">information retrieval</a> tool that uses the data of a <a href="Web_search_engine" class="mw-redirect" title="Web search engine">web search engine</a> to produce its own results.<sup id="cite_ref-1" class="reference"><a href="#cite_note-1"><span class="cite-bracket">[</span>1<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-Architecture_2-0" class="reference"><a href="#cite_note-Architecture-2"><span class="cite-bracket">[</span>2<span class="cite-bracket">]</span></a></sup> Metasearch engines take input from a user and immediately query search engines<sup id="cite_ref-3" class="reference"><a href="#cite_note-3"><span class="cite-bracket">[</span>3<span class="cite-bracket">]</span></a></sup> for results. Sufficient <a href="Data" title="Data">data</a> is gathered, ranked, and presented to the users.

</p><p>Problems such as <a href="Spamming" title="Spamming">spamming</a> reduce the <a href="Accuracy_and_precision" title="Accuracy and precision">accuracy and precision</a> of results.<sup id="cite_ref-4" class="reference"><a href="#cite_note-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup> The process of fusion aims to improve the engineering of a metasearch engine.<sup id="cite_ref-5" class="reference"><a href="#cite_note-5"><span class="cite-bracket">[</span>5<span class="cite-bracket">]</span></a></sup>

</p><p>Examples of metasearch engines include <a href="Skyscanner" title="Skyscanner">Skyscanner</a> and <a href="Kayak.com" class="mw-redirect" title="Kayak.com">Kayak.com</a>, which aggregate search results of online travel agencies and provider websites. <a href="SearXNG" title="SearXNG">SearXNG</a> is a generic <a href="Free_software" title="Free software">free</a> and <a href="Open-source" class="mw-redirect" title="Open-source">open-source</a> search software which aggregates results from internet search engines and other sources like Wikipedia and is offered for free by more than 70 SearXNG providers.<sup id="cite_ref-6" class="reference"><a href="#cite_note-6"><span class="cite-bracket">[</span>6<span class="cite-bracket">]</span></a></sup>

</p>

<div class="mw-heading mw-heading2"><h2 id="History">History</h2></div>

<p>The first person to incorporate the idea of meta searching was <a href="University_of_Washington" title="University of Washington">University of Washington</a> student Eric Selberg,<sup id="cite_ref-7" class="reference"><a href="#cite_note-7"><span class="cite-bracket">[</span>7<span class="cite-bracket">]</span></a></sup> who published a paper about his <a href="MetaCrawler" title="MetaCrawler">MetaCrawler</a> experiment in 1995. The search engine is still usable as of 2024.<sup id="cite_ref-8" class="reference"><a href="#cite_note-8"><span class="cite-bracket">[</span>8<span class="cite-bracket">]</span></a></sup>

</p><p>On May 20, 1996, <a href="HotBot" title="HotBot">HotBot</a>, then owned by <a href="Wired_(magazine)" title="Wired (magazine)">Wired</a>, was a search engine with search results coming from the <a href="Inktomi" title="Inktomi">Inktomi</a> and Direct Hit databases. It was known for its fast results and as a search engine with the ability to search within search results. Upon being bought by <a href="Lycos" title="Lycos">Lycos</a> in 1998, development for the search engine staggered and its market share fell drastically. After going through a few alterations, HotBot was redesigned into a simplified search interface, with its features being incorporated into Lycos' website redesign.<sup id="cite_ref-9" class="reference"><a href="#cite_note-9"><span class="cite-bracket">[</span>9<span class="cite-bracket">]</span></a></sup>

</p><p>In 1997, Daniel Dreilinger published a paper on his experimental metasearch engine, SavvySearch, which was able to automatically select the correct search engine to prioritize based on prior experience.<sup id="cite_ref-Howe1997_10-0" class="reference"><a href="#cite_note-Howe1997-10"><span class="cite-bracket">[</span>10<span class="cite-bracket">]</span></a></sup>

</p><p>A metasearch engine called Anvish was developed by Bo Shu and <a href="Subhash_Kak" title="Subhash Kak">Subhash Kak</a> in 1999; the search results were sorted using <a href="Instantaneously_trained_neural_networks" title="Instantaneously trained neural networks">instantaneously trained neural networks</a>.<sup id="cite_ref-11" class="reference"><a href="#cite_note-11"><span class="cite-bracket">[</span>11<span class="cite-bracket">]</span></a></sup> This was later incorporated into another metasearch engine called Solosearch.<sup id="cite_ref-12" class="reference"><a href="#cite_note-12"><span class="cite-bracket">[</span>12<span class="cite-bracket">]</span></a></sup>

</p><p>In August 2000, India got its first meta search engine when HumHaiIndia.com was launched.<sup id="cite_ref-13" class="reference"><a href="#cite_note-13"><span class="cite-bracket">[</span>13<span class="cite-bracket">]</span></a></sup> It was developed by the then 16 year old Sumeet Lamba.<sup id="cite_ref-14" class="reference"><a href="#cite_note-14"><span class="cite-bracket">[</span>14<span class="cite-bracket">]</span></a></sup> The website was later rebranded as Tazaa.com.<sup id="cite_ref-15" class="reference"><a href="#cite_note-15"><span class="cite-bracket">[</span>15<span class="cite-bracket">]</span></a></sup>

</p><p><a href="Ixquick" class="mw-redirect" title="Ixquick">Ixquick</a> is a search engine known for its privacy policy statement. Developed and launched in 1998 by David Bodnick, it is owned by Surfboard Holding BV. In June 2006, Ixquick began to delete private details of its users following the same process with <a href="Scroogle" class="mw-redirect" title="Scroogle">Scroogle</a>. Ixquick's privacy policy includes no recording of users' IP addresses, no identifying cookies, no collection of personal data, and no sharing of personal data with third parties.<sup id="cite_ref-16" class="reference"><a href="#cite_note-16"><span class="cite-bracket">[</span>16<span class="cite-bracket">]</span></a></sup> It also uses a unique ranking system where a result is ranked by stars. The more stars in a result, the more search engines agreed on the result.

</p><p>In April 2005, <a href="Dogpile" title="Dogpile">Dogpile</a>, then owned and operated by <a href="InfoSpace" title="InfoSpace">InfoSpace</a>, Inc., collaborated with researchers from the <a href="University_of_Pittsburgh" title="University of Pittsburgh">University of Pittsburgh</a> and <a href="Pennsylvania_State_University" title="Pennsylvania State University">Pennsylvania State University</a> to measure the overlap and ranking differences of leading Web search engines in order to gauge the benefits of using a metasearch engine to search the web. Results found that from 10,316 random user-defined queries from <a href="Google" title="Google">Google</a>, <a href="Yahoo!" class="mw-redirect" title="Yahoo!">Yahoo!</a>, and <a href="Ask_Jeeves" class="mw-redirect" title="Ask Jeeves">Ask Jeeves</a>, only 3.2% of first page search results were the same across those search engines for a given query. Another study later that year using 12,570 random user-defined queries from <a href="Google" title="Google">Google</a>, <a href="Yahoo!" class="mw-redirect" title="Yahoo!">Yahoo!</a>, <a href="Bing_(search_engine)" class="mw-redirect" title="Bing (search engine)">MSN Search</a>, and <a href="Ask_Jeeves" class="mw-redirect" title="Ask Jeeves">Ask Jeeves</a> found that only 1.1% of first page search results were the same across those search engines for a given query.<sup id="cite_ref-17" class="reference"><a href="#cite_note-17"><span class="cite-bracket">[</span>17<span class="cite-bracket">]</span></a></sup>

</p>

<div class="mw-heading mw-heading2"><h2 id="Advantages">Advantages</h2></div>

<p>By sending multiple queries to several other search engines this extends the <a href="Coverage_data" title="Coverage data">coverage data</a> of the topic and allows more information to be found. They use the indexes built by other search engines, aggregating and often post-processing results in unique ways. A metasearch engine has an advantage over a single search engine because more results can be <a href="Data_retrieval" title="Data retrieval">retrieved</a> with the same amount of exertion.<sup id="cite_ref-Architecture_2-1" class="reference"><a href="#cite_note-Architecture-2"><span class="cite-bracket">[</span>2<span class="cite-bracket">]</span></a></sup> It also reduces the work of users from having to individually type in searches from different engines to look for resources.<sup id="cite_ref-Architecture_2-2" class="reference"><a href="#cite_note-Architecture-2"><span class="cite-bracket">[</span>2<span class="cite-bracket">]</span></a></sup>

</p><p>Metasearching is also a useful approach if the purpose of the user's search is to get an overview of the topic or to get quick answers. Instead of having to go through multiple search engines like Yahoo! or Google and comparing results, metasearch engines are able to quickly compile and combine results. They can do it either by listing results from each engine queried with no additional post-processing (Dogpile) or by analyzing the results and ranking them by their own rules (IxQuick, Metacrawler, and Vivismo).

</p><p>A metasearch engine can also hide the searcher's IP address from the search engines queried thus providing privacy to the search.

</p>

<div class="mw-heading mw-heading2"><h2 id="Disadvantages">Disadvantages</h2></div>

<p>Metasearch engines are not capable of <a href="Parsing" title="Parsing">parsing</a> query forms or able to fully translate query <a href="Syntax_(logic)" title="Syntax (logic)">syntax</a>. The number of <a href="Hyperlink" title="Hyperlink">hyperlinks</a> generated by metasearch engines are limited, and therefore do not provide the user with the complete results of a query.<sup id="cite_ref-18" class="reference"><a href="#cite_note-18"><span class="cite-bracket">[</span>18<span class="cite-bracket">]</span></a></sup>

</p><p>The majority of metasearch engines do not provide over ten linked files from a single search engine, and generally do not interact with larger search engines for results. <a href="Pay_per_click" class="mw-redirect" title="Pay per click">Pay per click</a> links are prioritised and are normally displayed first.<sup id="cite_ref-19" class="reference"><a href="#cite_note-19"><span class="cite-bracket">[</span>19<span class="cite-bracket">]</span></a></sup>

</p><p>Metasearching also gives the illusion that there is more coverage of the topic queried, particularly if the user is searching for popular or commonplace information. It's common to end with multiple identical results from the queried engines. It is also harder for users to search with advanced search syntax to be sent with the query, so results may not be as precise as when a user is using an advanced search interface at a specific engine. This results in many metasearch engines using simple searching.<sup id="cite_ref-Hennegar2009_20-0" class="reference"><a href="#cite_note-Hennegar2009-20"><span class="cite-bracket">[</span>20<span class="cite-bracket">]</span></a></sup>

</p>

<div class="mw-heading mw-heading2"><h2 id="Operation">Operation</h2></div>

<p>A metasearch engine accepts a single search request from the <a href="User_(computing)" title="User (computing)">user</a>. This search request is then passed on to another search engine's <a href="Database" title="Database">database</a>. A metasearch engine does not create a database of <a href="Web_page" title="Web page">web pages</a> but generates a <a href="Federated_database_system" title="Federated database system">Federated database system</a> of <a href="Data_integration" title="Data integration">data integration</a> from multiple sources.<sup id="cite_ref-Meng2008_21-0" class="reference"><a href="#cite_note-Meng2008-21"><span class="cite-bracket">[</span>21<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-22" class="reference"><a href="#cite_note-22"><span class="cite-bracket">[</span>22<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-23" class="reference"><a href="#cite_note-23"><span class="cite-bracket">[</span>23<span class="cite-bracket">]</span></a></sup>

</p><p>Since every search engine is unique and has different <a href="Algorithms" class="mw-redirect" title="Algorithms">algorithms</a> for generating ranked data, duplicates will therefore also be generated. To remove duplicates, a metasearch engine processes this data and applies its own algorithm. A revised list is produced as an output for the user. When a metasearch engine contacts other search engines, these search engines will respond in three ways:

</p>

<ul><li>They will both cooperate and provide complete access to the interface for the metasearch engine, including private access to the index database, and will inform the metasearch engine of any changes made upon the index database;</li>

<li>Search engines can behave in a non-cooperative manner whereby they will not deny or provide any access to interfaces;</li>

<li>The search engine can be completely hostile and refuse the metasearch engine total access to their database and in serious circumstances, by seeking <a href="Legal" class="mw-redirect" title="Legal">legal</a> methods.<sup id="cite_ref-retrieval_24-0" class="reference"><a href="#cite_note-retrieval-24"><span class="cite-bracket">[</span>24<span class="cite-bracket">]</span></a></sup></li></ul>

<div class="mw-heading mw-heading3"><h3 id="Architecture_of_ranking">Architecture of ranking</h3></div>

<p>Web pages that are highly ranked on many search engines are likely to be more <a href="Relevance_(information_retrieval)" title="Relevance (information retrieval)">relevant</a> in providing useful information.<sup id="cite_ref-retrieval_24-1" class="reference"><a href="#cite_note-retrieval-24"><span class="cite-bracket">[</span>24<span class="cite-bracket">]</span></a></sup> However, all search engines have different ranking scores for each website and most of the time these scores are not the same. This is because search engines prioritise different criteria and methods for scoring, hence a website might appear highly ranked on one search engine and lowly ranked on another. This is a problem because Metasearch engines rely heavily on the consistency of this data to generate reliable accounts.<sup id="cite_ref-retrieval_24-2" class="reference"><a href="#cite_note-retrieval-24"><span class="cite-bracket">[</span>24<span class="cite-bracket">]</span></a></sup>

</p>

<div class="mw-heading mw-heading3"><h3 id="Fusion">Fusion</h3></div>

<p>A metasearch engine uses the process of Fusion to filter data for more efficient results. The two main fusion methods used are: Collection Fusion and Data Fusion.

</p>

<ul><li>Collection Fusion: also known as distributed retrieval, deals specifically with search engines that index unrelated data. To determine how valuable these sources are, Collection Fusion looks at the content and then ranks the data on how likely it is to provide relevant information in relation to the query. From what is generated, Collection Fusion is able to pick out the best resources from the rank. These chosen resources are then merged into a list.<sup id="cite_ref-retrieval_24-3" class="reference"><a href="#cite_note-retrieval-24"><span class="cite-bracket">[</span>24<span class="cite-bracket">]</span></a></sup></li>

<li>Data Fusion: deals with information retrieved from search engines that indexes common data sets. The process is very similar. The initial rank scores of data are merged into a single list, after which the original ranks of each of these documents are analysed. Data with high scores indicate a high level of relevancy to a particular query and are therefore selected. To produce a list, the scores must be normalized using algorithms such as CombSum. This is because search engines adopt different policies of algorithms resulting in the score produced being incomparable.<sup id="cite_ref-25" class="reference"><a href="#cite_note-25"><span class="cite-bracket">[</span>25<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-26" class="reference"><a href="#cite_note-26"><span class="cite-bracket">[</span>26<span class="cite-bracket">]</span></a></sup></li></ul>

<div class="mw-heading mw-heading2"><h2 id="Spamdexing">Spamdexing</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .hatnote{font-style:italic}.mw-parser-output div.hatnote{padding-left:1.6em;margin-bottom:0.5em}.mw-parser-output .hatnote i{font-style:normal}.mw-parser-output .hatnote+link+.hatnote{margin-top:-0.5em}@media print{body.ns-0 .mw-parser-output .hatnote{display:none!important}}

/* end https://en.wikipedia.org/ */

</style><div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Spamdexing" title="Spamdexing">Spamdexing</a></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .ambox{border:1px solid #a2a9b1;border-left:10px solid #36c;background-color:#fbfbfb;box-sizing:border-box}.mw-parser-output .ambox+link+.ambox,.mw-parser-output .ambox+link+style+.ambox,.mw-parser-output .ambox+link+link+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+style+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+link+.ambox{margin-top:-1px}html body.mediawiki .mw-parser-output .ambox.mbox-small-left{margin:4px 1em 4px 0;overflow:hidden;width:238px;border-collapse:collapse;font-size:88%;line-height:1.25em}.mw-parser-output .ambox-speedy{border-left:10px solid #b32424;background-color:#fee7e6}.mw-parser-output .ambox-delete{border-left:10px solid #b32424}.mw-parser-output .ambox-content{border-left:10px solid #f28500}.mw-parser-output .ambox-style{border-left:10px solid #fc3}.mw-parser-output .ambox-move{border-left:10px solid #9932cc}.mw-parser-output .ambox-protection{border-left:10px solid #a2a9b1}.mw-parser-output .ambox .mbox-text{border:none;padding:0.25em 0.5em;width:100%}.mw-parser-output .ambox .mbox-image{border:none;padding:2px 0 2px 0.5em;text-align:center}.mw-parser-output .ambox .mbox-imageright{border:none;padding:2px 0.5em 2px 0;text-align:center}.mw-parser-output .ambox .mbox-empty-cell{border:none;padding:0;width:1px}.mw-parser-output .ambox .mbox-image-div{width:52px}@media(min-width:720px){.mw-parser-output .ambox{margin:0 10%}}@media print{body.ns-0 .mw-parser-output .ambox{display:none!important}}

/* end https://en.wikipedia.org/ */

</style>

<p>Spamdexing is the deliberate manipulation of search engine indexes. It uses a number of methods to manipulate the relevance or prominence of resources indexed in a manner unaligned with the intention of the indexing system. Spamdexing can be very distressing for users and problematic for search engines because the return contents of searches have poor precision. This will eventually result in the search engine becoming unreliable and not dependable for the user. To tackle Spamdexing, search robot algorithms are made more complex and are changed almost every day to eliminate the problem.<sup id="cite_ref-27" class="reference"><a href="#cite_note-27"><span class="cite-bracket">[</span>27<span class="cite-bracket">]</span></a></sup>

</p><p>It is a major problem for metasearch engines because it tampers with the <a href="Web_crawler" title="Web crawler">Web crawler</a>'s indexing criteria, which are heavily relied upon to format ranking lists. Spamdexing manipulates the natural <a href="Ranking" title="Ranking">ranking</a> system of a search engine, and places websites higher on the ranking list than they would naturally be placed.<sup id="cite_ref-28" class="reference"><a href="#cite_note-28"><span class="cite-bracket">[</span>28<span class="cite-bracket">]</span></a></sup> There are three primary methods used to achieve this:

</p>

<div class="mw-heading mw-heading3"><h3 id="Content_spam">Content spam</h3></div>

<p>Content spam are the techniques that alter the logical view that a search engine has over the page's contents. Techniques include:

</p>

<ul><li>Keyword Stuffing – Calculated placements of keywords within a page to raise the keyword count, variety, and density of the page</li>

<li>Hidden/Invisible Text – Unrelated text disguised by making it the same color as the background, using a tiny font size, or hiding it within the HTML code</li>

<li>Meta-tag Stuffing – Repeating keywords in meta tags and/or using keywords unrelated to the site's content</li>

<li>Doorway Pages – Low quality webpages with little content, but relatable keywords or phrases</li>

<li>Scraper Sites – Programs that allow websites to copy content from other websites and create content for a website</li>

<li>Article Spinning – Rewriting existing articles as opposed to copying content from other sites</li>

<li>Machine Translation – Uses machine translation to rewrite content in several different languages, resulting in illegible text</li></ul>

<p>Link spam are links between pages present for reasons other than merit. Techniques include:

</p>

<ul><li>Link-building Software – Automating the <a href="Search_engine_optimization" title="Search engine optimization">search engine optimization</a> (SEO) process</li>

<li>Link Farms – Pages that reference each other (also known as mutual admiration societies)</li>

<li>Hidden Links – Placing hyperlinks where visitors won't or can't see them</li>

<li>Sybil Attack – Forging of multiple identities for malicious intent</li>

<li>Spam Blogs – Blogs created solely for commercial promotion and the passage of link authority to target sites</li>

<li>Page Hijacking – Creating a copy of a popular website with similar content, but redirects web surfers to unrelated or even malicious websites</li>

<li>Buying Expired Domains – Buying expiring domains and replacing pages with links to unrelated websites</li>

<li>Cookie Stuffing – Placing an affiliate tracking cookie on a website visitor's computer without their knowledge</li>

<li>Forum Spam – Websites that can be edited by users to insert links to spam sites</li></ul>

<div class="mw-heading mw-heading3"><h3 id="Cloaking">Cloaking</h3></div>

<p>This is an SEO technique in which different materials and information are sent to the web crawler and to the <a href="Web_browser" title="Web browser">web browser</a>.<sup id="cite_ref-29" class="reference"><a href="#cite_note-29"><span class="cite-bracket">[</span>29<span class="cite-bracket">]</span></a></sup> It is commonly used as a spamdexing technique because it can trick search engines into either visiting a site that is substantially different from the search engine description or giving a certain site a higher ranking.

</p>

<ul><li><a href="Federated_search" title="Federated search">Federated search</a></li>

<li><a href="List_of_metasearch_engines" class="mw-redirect" title="List of metasearch engines">List of metasearch engines</a></li>

<li><a href="Metabrowsing" title="Metabrowsing">Metabrowsing</a></li>

<li><a href="Multisearch" title="Multisearch">Multisearch</a></li>

<li><a href="Search_aggregator" title="Search aggregator">Search aggregator</a></li>

<li><a href="Search_engine_optimization" title="Search engine optimization">Search engine optimization</a></li></ul>

<div class="mw-heading mw-heading2"><h2 id="References">References</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}

/* end https://en.wikipedia.org/ */

</style><div class="reflist reflist-columns references-column-width">

/* start https://en.wikipedia.org/ */

.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("./mw/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("./mw/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("./mw/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("./mw/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}

/* end https://en.wikipedia.org/ */

</style><cite id="CITEREFBerger2005" class="citation document cs1">Berger, Sandy (2005). "Sandy Berger's Great Age Guide to the Internet" (Document). Que Publishing.</cite> <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>0-7897-3442-7</bdi>.</span>

</li>

<li id="cite_note-Architecture-2"><span class="mw-cite-backlink">^ <a href="#cite_ref-Architecture_2-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-Architecture_2-1"><sup><i><b>b</b></i></sup></a> <a href="#cite_ref-Architecture_2-2"><sup><i><b>c</b></i></sup></a></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.researchgate.net/publication/2596239">"Architecture of a Metasearch Engine that Supports User Information Needs"</a>. 1999.</cite></span>

</li>

<li id="cite_note-3"><span class="mw-cite-backlink"><b><a href="#cite_ref-3">^</a></b></span> <span class="reference-text"><cite id="CITEREFRide2021" class="citation web cs1">Ride, Onion (2021). <a rel="nofollow" class="external text" href="https://www.onionride.com/p/onionride-how-search-engines-operate.html">"How search Engine work"</a>. onionride.</cite></span>

</li>

<li id="cite_note-4"><span class="mw-cite-backlink"><b><a href="#cite_ref-4">^</a></b></span> <span class="reference-text"><cite id="CITEREFLawrenceLee_Giles1997" class="citation web cs1">Lawrence, Stephen R.; Lee Giles, C. (October 10, 1997). <a rel="nofollow" class="external text" href="https://patents.google.com/patent/US6999959">"Patent US6999959 - Meta search engine"</a> – via <a href="Google_Books" title="Google Books">Google Books</a>.</cite></span>

</li>

<li id="cite_note-5"><span class="mw-cite-backlink"><b><a href="#cite_ref-5">^</a></b></span> <span class="reference-text"><cite id="CITEREFVoorheesGuptaJohnson-Laird2000" class="citation web cs1"><a href="Ellen_Voorhees" title="Ellen Voorhees">Voorhees, Ellen M.</a>; Gupta, Narendra; Johnson-Laird, Ben (April 2000). <a rel="nofollow" class="external text" href="https://www.researchgate.net/publication/2457240">"The collection fusion problem"</a>.</cite></span>

</li>

<li id="cite_note-6"><span class="mw-cite-backlink"><b><a href="#cite_ref-6">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://searx.space">"SearXNG instances"</a>. 2025-02-03.</cite></span>

</li>

<li id="cite_note-7"><span class="mw-cite-backlink"><b><a href="#cite_ref-7">^</a></b></span> <span class="reference-text"><cite id="CITEREFSelbergEtzioni1995" class="citation book cs1">Selberg, Erik; Etzioni, Oren (1995-12-11). <a rel="nofollow" class="external text" href="https://dl.acm.org/doi/abs/10.1145/3592626.3592641">"Multi-Engine Search and Comparison Using the MetaCrawler"</a>. <i>Proceedings of the Fourth International Conference on World Wide Web</i>. WWW4. New York, NY, USA: Association for Computing Machinery. pp. <span class="nowrap">195–</span>208. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F3592626.3592641">10.1145/3592626.3592641</a>. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-1-56592-169-6</bdi>.</cite></span>

</li>

<li id="cite_note-8"><span class="mw-cite-backlink"><b><a href="#cite_ref-8">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.metacrawler.com/">"Metacrawler"</a>. <i>www.metacrawler.com</i><span class="reference-accessdate">. Retrieved <span class="nowrap">2024-12-05</span></span>.</cite></span>

</li>

<li id="cite_note-9"><span class="mw-cite-backlink"><b><a href="#cite_ref-9">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://www.websearchworkshop.co.uk/hotbot_history.php">"Search engine rankings on HotBot: a brief history of the HotBot search engine"</a>.</cite></span>

</li>

<li id="cite_note-Howe1997-10"><span class="mw-cite-backlink"><b><a href="#cite_ref-Howe1997_10-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFHoweDreilinger1997" class="citation journal cs1">Howe, Adele E.; Dreilinger, Daniel (1997-06-15). <a rel="nofollow" class="external text" href="https://ojs.aaai.org/aimagazine/index.php/aimagazine/article/view/1290">"SavvySearch: A Metasearch Engine that Learns which Search Engines to Query"</a>. <i>AI Magazine</i>. <b>18</b> (2): 19. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1609%2Faimag.v18i2.1290">10.1609/aimag.v18i2.1290</a>. <a href="ISSN_(identifier)" class="mw-redirect" title="ISSN (identifier)">ISSN</a> <a rel="nofollow" class="external text" href="https://search.worldcat.org/issn/2371-9621">2371-9621</a>.</cite></span>

</li>

<li id="cite_note-11"><span class="mw-cite-backlink"><b><a href="#cite_ref-11">^</a></b></span> <span class="reference-text"><cite id="CITEREFShuKak1999" class="citation journal cs1">Shu, Bo; <a href="Subhash_Kak" title="Subhash Kak">Kak, Subhash</a> (1999). "A neural network based intelligent metasearch engine". <i>Information Sciences</i>. <b>120</b> (4): <span class="nowrap">1–</span>11. <a href="CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.6837">10.1.1.84.6837</a></span>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1016%2FS0020-0255%2899%2900062-6">10.1016/S0020-0255(99)00062-6</a>.</cite></span>

</li>

<li id="cite_note-12"><span class="mw-cite-backlink"><b><a href="#cite_ref-12">^</a></b></span> <span class="reference-text"><cite id="CITEREFKak1999" class="citation web cs1"><a href="Subhash_Kak" title="Subhash Kak">Kak, Subhash</a> (November 1999). <a rel="nofollow" class="external text" href="http://www.ece.lsu.edu/kak/x5kak.lo.pdf">"Better Web searches and prediction with instantaneously trained neural networks"</a> <span class="cs1-format">(PDF)</span>. IEEE Intelligent Systems.</cite></span>

</li>

<li id="cite_note-13"><span class="mw-cite-backlink"><b><a href="#cite_ref-13">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.indiatoday.in/magazine/science-and-technology/story/20000904-new-kid-in-town-761641-2012-07-06">"New kid in town"</a>. <i>India Today</i>. 6 July 2012<span class="reference-accessdate">. Retrieved <span class="nowrap">2024-03-14</span></span>.</cite></span>

</li>

<li id="cite_note-14"><span class="mw-cite-backlink"><b><a href="#cite_ref-14">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.geeksforgeeks.org/what-is-metasearch-engine/">"What is Metasearch Engine?"</a>. <i>GeeksforGeeks</i>. 2020-08-01<span class="reference-accessdate">. Retrieved <span class="nowrap">2024-03-14</span></span>.</cite></span>

</li>

<li id="cite_note-15"><span class="mw-cite-backlink"><b><a href="#cite_ref-15">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.metaseek.nl/">"www.metaseek.nl"</a>. <i>www.metaseek.nl</i><span class="reference-accessdate">. Retrieved <span class="nowrap">2024-03-14</span></span>.</cite></span>

</li>

<li id="cite_note-16"><span class="mw-cite-backlink"><b><a href="#cite_ref-16">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.startpage.com/en/about-us.html">"About Us – Our History"</a>.</cite></span>

</li>

<li id="cite_note-17"><span class="mw-cite-backlink"><b><a href="#cite_ref-17">^</a></b></span> <span class="reference-text"><cite id="CITEREFSpinkJansenKathuriaKoshman2006" class="citation web cs1">Spink, Amanda; Jansen, Bernard J.; Kathuria, Vinish; Koshman, Sherry (2006). <a rel="nofollow" class="external text" href="http://www.bernardjjansen.com/uploads/2/4/1/8/24188166/jansen_overlap_intr.pdf">"Overlap among major web search engines"</a> <span class="cs1-format">(PDF)</span>. Emerald.</cite></span>

</li>

<li id="cite_note-18"><span class="mw-cite-backlink"><b><a href="#cite_ref-18">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www3.unifr.ch/inf/en/">"Department of Informatics"</a>. <a href="University_of_Fribourg" title="University of Fribourg">University of Fribourg</a>.</cite></span>

</li>

<li id="cite_note-19"><span class="mw-cite-backlink"><b><a href="#cite_ref-19">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://nsarchive.gwu.edu/NSAEBB/NSAEBB436/docs/EBB-005.pdf">"Intelligence Exploitation of the Internet"</a> <span class="cs1-format">(PDF)</span>. 2002.</cite></span>

</li>

<li id="cite_note-Hennegar2009-20"><span class="mw-cite-backlink"><b><a href="#cite_ref-Hennegar2009_20-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFHennegar2009" class="citation web cs1">Hennegar, Anne (16 September 2009). <a rel="nofollow" class="external text" href="https://www.timeatlas.com/metasearch-engines-expands-your-horizon/">"Metasearch Engines Expands your Horizon"</a>.</cite></span>

</li>

<li id="cite_note-Meng2008-21"><span class="mw-cite-backlink"><b><a href="#cite_ref-Meng2008_21-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFMeng2008" class="citation web cs1">Meng, Weiyi (May 5, 2008). <a rel="nofollow" class="external text" href="http://www.cs.binghamton.edu/~meng/pub.d/EDBS_Metasearch.pdf">"Metasearch Engines"</a> <span class="cs1-format">(PDF)</span>.</cite></span>

</li>

<li id="cite_note-22"><span class="mw-cite-backlink"><b><a href="#cite_ref-22">^</a></b></span> <span class="reference-text"><cite id="CITEREFSelbergEtzioni1997" class="citation web cs1">Selberg, Erik; Etzioni, Oren (1997). <a rel="nofollow" class="external text" href="https://homes.cs.washington.edu/~etzioni/papers/ieee-metacrawler.html">"The MetaCrawler architecture for resource aggregation on the Web"</a>. IEEE expert. pp. <span class="nowrap">11–</span>14.</cite></span>

</li>

<li id="cite_note-23"><span class="mw-cite-backlink"><b><a href="#cite_ref-23">^</a></b></span> <span class="reference-text"><cite id="CITEREFManojJacob2013" class="citation web cs1">Manoj, M; Jacob, Elizabeth (July 2013). <a rel="nofollow" class="external text" href="https://research.ijcaonline.org/volume74/number5/pxc3889739.pdf">"Design and Development of a Programmable Meta Search Engine"</a> <span class="cs1-format">(PDF)</span>. Foundation of Computer Science. pp. <span class="nowrap">6–</span>11.</cite></span>

</li>

<li id="cite_note-retrieval-24"><span class="mw-cite-backlink">^ <a href="#cite_ref-retrieval_24-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-retrieval_24-1"><sup><i><b>b</b></i></sup></a> <a href="#cite_ref-retrieval_24-2"><sup><i><b>c</b></i></sup></a> <a href="#cite_ref-retrieval_24-3"><sup><i><b>d</b></i></sup></a></span> <span class="reference-text"><cite id="CITEREFManojJacob2008" class="citation web cs1">Manoj, M.; Jacob, Elizabeth (October 2008). <a rel="nofollow" class="external text" href="http://nopr.niscair.res.in/bitstream/123456789/2243/1/JSIR%2067(10)%20739-746.pdf">"Information retrieval on Internet using meta-search engines: A review"</a> <span class="cs1-format">(PDF)</span>. <a href="Council_of_Scientific_and_Industrial_Research" title="Council of Scientific and Industrial Research">Council of Scientific and Industrial Research</a>.</cite></span>

</li>

<li id="cite_note-25"><span class="mw-cite-backlink"><b><a href="#cite_ref-25">^</a></b></span> <span class="reference-text"><cite id="CITEREFWuCrestaniBi2006" class="citation book cs1">Wu, Shengli; Crestani, Fabio; Bi, Yaxin (2006). "Evaluating Score Normalization Methods in Data Fusion". <i>Information Retrieval Technology</i>. Lecture Notes in Computer Science. Vol. 4182. pp. <span class="nowrap">642–</span>648. <a href="CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.295">10.1.1.103.295</a></span>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1007%2F11880592_57">10.1007/11880592_57</a>. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-3-540-45780-0</bdi>.</cite></span>

</li>

<li id="cite_note-26"><span class="mw-cite-backlink"><b><a href="#cite_ref-26">^</a></b></span> <span class="reference-text"><cite id="CITEREFManmathaSever2014" class="citation web cs1">Manmatha, R.; Sever, H. (2014). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20190930051034/http://maroo.cs.umass.edu/pdf/IR-242.pdf">"A Formal Approach to Score Normalization for Meta-search"</a> <span class="cs1-format">(PDF)</span>. Archived from <a rel="nofollow" class="external text" href="http://maroo.cs.umass.edu/pdf/IR-242.pdf">the original</a> <span class="cs1-format">(PDF)</span> on 2019-09-30<span class="reference-accessdate">. Retrieved <span class="nowrap">2014-10-27</span></span>.</cite></span>

</li>

<li id="cite_note-27"><span class="mw-cite-backlink"><b><a href="#cite_ref-27">^</a></b></span> <span class="reference-text"><cite id="CITEREFNajork2014" class="citation web cs1">Najork, Marc (2014). <a rel="nofollow" class="external text" href="https://www.microsoft.com/en-us/research/publication/web-spam-detection/">"Web Spam Detection"</a>. <a href="Microsoft" title="Microsoft">Microsoft</a>.</cite></span>

</li>

<li id="cite_note-28"><span class="mw-cite-backlink"><b><a href="#cite_ref-28">^</a></b></span> <span class="reference-text"><cite id="CITEREFVandendriessche2009" class="citation web cs1">Vandendriessche, Gerrit (February 2009). <a rel="nofollow" class="external text" href="https://www.worldservicesgroup.com/publications.asp?action=article&artid=2801">"A few legal comments on spamdexing"</a>.</cite></span>

</li>

<li id="cite_note-29"><span class="mw-cite-backlink"><b><a href="#cite_ref-29">^</a></b></span> <span class="reference-text"><cite id="CITEREFWangMaNiuChen2007" class="citation web cs1">Wang, Yi-Min; Ma, Ming; Niu, Yuan; Chen, Hao (May 8, 2007). <a rel="nofollow" class="external text" href="http://www2007.org/papers/paper111.pdf">"Connecting Web Spammers with Advertisers"</a> <span class="cs1-format">(PDF)</span>.</cite></span>

</li>

</ol></div><div class="navbox-styles"><style data-mw-deduplicate="TemplateStyles:r1129693374">

/* start https://en.wikipedia.org/ */

.mw-parser-output .hlist dl,.mw-parser-output .hlist ol,.mw-parser-output .hlist ul{margin:0;padding:0}.mw-parser-output .hlist dd,.mw-parser-output .hlist dt,.mw-parser-output .hlist li{margin:0;display:inline}.mw-parser-output .hlist.inline,.mw-parser-output .hlist.inline dl,.mw-parser-output .hlist.inline ol,.mw-parser-output .hlist.inline ul,.mw-parser-output .hlist dl dl,.mw-parser-output .hlist dl ol,.mw-parser-output .hlist dl ul,.mw-parser-output .hlist ol dl,.mw-parser-output .hlist ol ol,.mw-parser-output .hlist ol ul,.mw-parser-output .hlist ul dl,.mw-parser-output .hlist ul ol,.mw-parser-output .hlist ul ul{display:inline}.mw-parser-output .hlist .mw-empty-li{display:none}.mw-parser-output .hlist dt::after{content:": "}.mw-parser-output .hlist dd::after,.mw-parser-output .hlist li::after{content:" · ";font-weight:bold}.mw-parser-output .hlist dd:last-child::after,.mw-parser-output .hlist dt:last-child::after,.mw-parser-output .hlist li:last-child::after{content:none}.mw-parser-output .hlist dd dd:first-child::before,.mw-parser-output .hlist dd dt:first-child::before,.mw-parser-output .hlist dd li:first-child::before,.mw-parser-output .hlist dt dd:first-child::before,.mw-parser-output .hlist dt dt:first-child::before,.mw-parser-output .hlist dt li:first-child::before,.mw-parser-output .hlist li dd:first-child::before,.mw-parser-output .hlist li dt:first-child::before,.mw-parser-output .hlist li li:first-child::before{content:" (";font-weight:normal}.mw-parser-output .hlist dd dd:last-child::after,.mw-parser-output .hlist dd dt:last-child::after,.mw-parser-output .hlist dd li:last-child::after,.mw-parser-output .hlist dt dd:last-child::after,.mw-parser-output .hlist dt dt:last-child::after,.mw-parser-output .hlist dt li:last-child::after,.mw-parser-output .hlist li dd:last-child::after,.mw-parser-output .hlist li dt:last-child::after,.mw-parser-output .hlist li li:last-child::after{content:")";font-weight:normal}.mw-parser-output .hlist ol{counter-reset:listitem}.mw-parser-output .hlist ol>li{counter-increment:listitem}.mw-parser-output .hlist ol>li::before{content:" "counter(listitem)"\a0 "}.mw-parser-output .hlist dd ol>li:first-child::before,.mw-parser-output .hlist dt ol>li:first-child::before,.mw-parser-output .hlist li ol>li:first-child::before{content:" ("counter(listitem)"\a0 "}

/* end https://en.wikipedia.org/ */

</style><style data-mw-deduplicate="TemplateStyles:r1236075235">

/* start https://en.wikipedia.org/ */

.mw-parser-output .navbox{box-sizing:border-box;border:1px solid #a2a9b1;width:100%;clear:both;font-size:88%;text-align:center;padding:1px;margin:1em auto 0}.mw-parser-output .navbox .navbox{margin-top:0}.mw-parser-output .navbox+.navbox,.mw-parser-output .navbox+.navbox-styles+.navbox{margin-top:-1px}.mw-parser-output .navbox-inner,.mw-parser-output .navbox-subgroup{width:100%}.mw-parser-output .navbox-group,.mw-parser-output .navbox-title,.mw-parser-output .navbox-abovebelow{padding:0.25em 1em;line-height:1.5em;text-align:center}.mw-parser-output .navbox-group{white-space:nowrap;text-align:right}.mw-parser-output .navbox,.mw-parser-output .navbox-subgroup{background-color:#fdfdfd}.mw-parser-output .navbox-list{line-height:1.5em;border-color:#fdfdfd}.mw-parser-output .navbox-list-with-group{text-align:left;border-left-width:2px;border-left-style:solid}.mw-parser-output tr+tr>.navbox-abovebelow,.mw-parser-output tr+tr>.navbox-group,.mw-parser-output tr+tr>.navbox-image,.mw-parser-output tr+tr>.navbox-list{border-top:2px solid #fdfdfd}.mw-parser-output .navbox-title{background-color:#ccf}.mw-parser-output .navbox-abovebelow,.mw-parser-output .navbox-group,.mw-parser-output .navbox-subgroup .navbox-title{background-color:#ddf}.mw-parser-output .navbox-subgroup .navbox-group,.mw-parser-output .navbox-subgroup .navbox-abovebelow{background-color:#e6e6ff}.mw-parser-output .navbox-even{background-color:#f7f7f7}.mw-parser-output .navbox-odd{background-color:transparent}.mw-parser-output .navbox .hlist td dl,.mw-parser-output .navbox .hlist td ol,.mw-parser-output .navbox .hlist td ul,.mw-parser-output .navbox td.hlist dl,.mw-parser-output .navbox td.hlist ol,.mw-parser-output .navbox td.hlist ul{padding:0.125em 0}.mw-parser-output .navbox .navbar{display:block;font-size:100%}.mw-parser-output .navbox-title .navbar{float:left;text-align:left;margin-right:0.5em}body.skin--responsive .mw-parser-output .navbox-image img{max-width:none!important}@media print{body.ns-0 .mw-parser-output .navbox{display:none!important}}

/* end https://en.wikipedia.org/ */

</style></div><div role="navigation" class="navbox" aria-labelledby="Web_search_engines153" style="padding:3px"><table class="nowraplinks hlist mw-collapsible autocollapse navbox-inner" style="border-spacing:0;background:transparent;color:inherit"><tbody><tr><th scope="col" class="navbox-title" colspan="2"><style data-mw-deduplicate="TemplateStyles:r1239400231">

/* start https://en.wikipedia.org/ */

.mw-parser-output .navbar{display:inline;font-size:88%;font-weight:normal}.mw-parser-output .navbar-collapse{float:left;text-align:left}.mw-parser-output .navbar-boxtext{word-spacing:0}.mw-parser-output .navbar ul{display:inline-block;white-space:nowrap;line-height:inherit}.mw-parser-output .navbar-brackets::before{margin-right:-0.125em;content:"[ "}.mw-parser-output .navbar-brackets::after{margin-left:-0.125em;content:" ]"}.mw-parser-output .navbar li{word-spacing:-0.125em}.mw-parser-output .navbar a>span,.mw-parser-output .navbar a>abbr{text-decoration:inherit}.mw-parser-output .navbar-mini abbr{font-variant:small-caps;border-bottom:none;text-decoration:none;cursor:inherit}.mw-parser-output .navbar-ct-full{font-size:114%;margin:0 7em}.mw-parser-output .navbar-ct-mini{font-size:114%;margin:0 4em}html.skin-theme-clientpref-night .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}@media(prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}}@media print{.mw-parser-output .navbar{display:none!important}}

/* end https://en.wikipedia.org/ */

</style><div id="Web_search_engines153" style="font-size:114%;margin:0 4em"><a href="Search_engine" title="Search engine">Web search engines</a></div></th></tr><tr><th scope="row" class="navbox-group" style="width:1%">Active</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"></div><table class="nowraplinks hlist navbox-subgroup" style="border-spacing:0"><tbody><tr><th scope="row" class="navbox-group" style="width:1%;text-align:center;">Dedicated</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em">

<li><a href="Ahmia" title="Ahmia">Ahmia</a></li>

<li><a href="Baidu" title="Baidu">Baidu</a></li>

<li><a href="Blackle" title="Blackle">Blackle</a></li>

<li><a href="Brave_Search" title="Brave Search">Brave</a></li>

<li><a href="DuckDuckGo" title="DuckDuckGo">DuckDuckGo</a></li>

<li><a href="Ecosia" title="Ecosia">Ecosia</a></li>

<li><a href="Fireball_(search_engine)" title="Fireball (search engine)">Fireball</a></li>

<li><a href="Google_Search" title="Google Search">Google</a></li>

<li><a href="Kiddle_(search_engine)" title="Kiddle (search engine)">Kiddle</a></li>

<li><a href="KidRex" title="KidRex">KidRex</a></li>

<li><a href="KidzSearch" class="mw-redirect" title="KidzSearch">KidzSearch</a></li>

<li><a href="Lycos" title="Lycos">Lycos</a></li>

<li><a href="Mojeek" title="Mojeek">Mojeek</a></li>

<li><a href="Naver" title="Naver">Naver</a></li>

<li><a href="Parsijoo" title="Parsijoo">Parsijoo</a></li>

<li><a href="Perplexity_AI" title="Perplexity AI">Perplexity AI</a></li>

<li><a href="Petal_Search" title="Petal Search">Petal</a></li>

<li><a href="Presearch_(search_engine)" title="Presearch (search engine)">Presearch</a></li>

<li><a href="Seznam.cz" title="Seznam.cz">Seznam.cz</a></li>

<li><a href="Sogou" title="Sogou">Sogou</a></li>

<li><a href="Swisscows" title="Swisscows">Swisscows</a></li>

<li><a href="WebCrawler" title="WebCrawler">WebCrawler</a></li>

<li><a href="Yahoo_Search" title="Yahoo Search">Yahoo!</a></li>

<li><a href="Yandex_Search" title="Yandex Search">Yandex</a></li>

<li><a href="Youdao" title="Youdao">Youdao</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%;text-align:center;"></th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Dogpile" title="Dogpile">Dogpile</a></li>

<li><a href="Excite_(web_portal)" title="Excite (web portal)">Excite</a></li>

<li><a href="MetaCrawler" title="MetaCrawler">MetaCrawler</a></li>

<li><a href="MetaGer" title="MetaGer">MetaGer</a></li>

<li><a href="Mullvad_Leta" class="mw-redirect" title="Mullvad Leta">Mullvad Leta</a></li>

<li><a href="SearXNG" title="SearXNG">SearXNG</a></li>

<li><a href="Startpage.com" class="mw-redirect" title="Startpage.com">Startpage</a></li>

<li><a href="Qwant" title="Qwant">Qwant</a></li></ul>

</div></td></tr></tbody></table><div></div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Defunct<br>or<br>Inactive</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="123people" title="123people">123people</a></li>

<li><a href="Aliweb" class="mw-redirect" title="Aliweb">Aliweb</a></li>

<li><a href="AlltheWeb" title="AlltheWeb">AlltheWeb</a></li>

<li><a href="AltaVista" title="AltaVista">AltaVista</a></li>

<li><a href="Blekko" title="Blekko">Blekko</a></li>

<li><a href="Boogami" title="Boogami">Boogami</a></li>

<li><a href="Empas" title="Empas">Empas</a></li>

<li><a href="Forestle" title="Forestle">Forestle</a></li>

<li><a href="GenieKnows" title="GenieKnows">GenieKnows</a></li>

<li><a href="Gigablast" title="Gigablast">Gigablast</a></li>

<li><a href="HotBot" title="HotBot">HotBot</a></li>

<li><a href="Infoseek" title="Infoseek">Infoseek</a></li>

<li><a href="Inktomi" title="Inktomi">Inktomi</a></li>

<li><a href="JumpStation" title="JumpStation">JumpStation</a></li>

<li><a href="LeapFish" title="LeapFish">LeapFish</a></li>

<li><a href="Neeva" title="Neeva">Neeva</a></li>

<li><a href="Northern_Light_Group" title="Northern Light Group">Northern Light</a></li>

<li><a href="Pipilika" title="Pipilika">Pipilika</a></li>

<li><a href="Powerset_(company)" title="Powerset (company)">Powerset</a></li>

<li><a href="Scroogle" class="mw-redirect" title="Scroogle">Scroogle</a></li>

<li><a href="SearchMe" title="SearchMe">SearchMe</a></li>

<li><a href="Searx" title="Searx">Searx</a></li>

<li><a href="Sputnik_(search_engine)" title="Sputnik (search engine)">Sputnik</a></li>

<li><a href="Teoma" title="Teoma">Teoma</a></li>

<li><a href="Viewzi" title="Viewzi">Viewzi</a></li>

<li><a href="Vivisimo" title="Vivisimo">Vivisimo</a></li>

<li><a href="Volunia" title="Volunia">Volunia</a></li>

<li><a href="W3Catalog" title="W3Catalog">W3Catalog</a></li>

<li><a href="Wikiseek" title="Wikiseek">Wikiseek</a></li>

<li><a href="Yebol" title="Yebol">Yebol</a></li>

<li><a href="Yippy" title="Yippy">Yippy</a></li>

</div></td></tr><tr><td class="navbox-abovebelow" colspan="2"><div>

<ul><li><a href="Comparison_of_search_engines" title="Comparison of search engines">Comparison</a></li>

<li><a href="List_of_search_engines" title="List of search engines">Complete list</a></li></ul>

</div></td></tr></tbody></table></div></div><div><div class="zim-footer">

This article is issued from <a class="external text" title="Last edited on 2025-05-30" href="https://en.wikipedia.org/wiki/?title=Metasearch_engine&oldid=1293015493">Wikipedia</a>. The text is available under <a class="external text" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en">Creative Commons Attribution-Share Alike 4.0</a> unless otherwise noted. Additional terms may apply for the media files.

</div>

</div></div>

</div>

</main>

</div>

</body></html>